Parameterized Looped Schedules
نویسندگان
چکیده
This paper is concerned with the compact representation of execution sequences in terms of efficient looping constructs. Here, by a looping construct we mean a compact way of specifying a finite repetition of a set of execution primitives (“instructions”). Such compaction, which can be viewed as a form of hierarchical run-length encoding, has application in many embedded software contexts, including efficient control generation for Kahn processes [6], and software synthesis for static dataflow models of computation, such as synchronous dataflow [1] and cyclo-static dataflow [3]. In this paper, we significantly generalize previous models for loop-based code compaction of DSP programs to yield a configurable code compression methodology that exhibits a broad range of achievable trade-offs. Specifically, we formally develop and apply to DSP hardware and software implementation a parameterizable loop scheduling approach with compact format, dynamic reconfigurability, and low overhead decompression.
منابع مشابه
Exploiting Synchronization for the Static Detection of Programming Errors
As asynchronous programming becomes more mainstream, program analyses capable of automatically uncovering programming errors are increasingly in demand. Since asynchronous program analysis is computationally costly, current approaches sacrifice completeness and focus on a limited set of thread schedules empirically likely to expose programming errors. These approaches make use of a parameterize...
متن کاملForecasting mortality: a parameterized time series approach.
This article links parameterized model mortality schedules with time series methods to develop forecasts of U.S. mortality to the year 2000. The use of model mortality schedules permits a relatively concise representation of the history of mortality by age and sex from 1900 to 1985, and the use of modern time series methods to extend this history forward to the end of this century allows for a ...
متن کاملFinding Free Schedules for Non-uniform Loops
An algorithm, permitting us to build free schedules for arbitrary nested non–uniform loops, is presented. The operations of each time schedule can be executed as soon as their operands are available. The algorithm requires exact dependence analysis. To describe and implement the algorithm and to carry out experiences, the dependence analysis by Pugh and Wonnacott was chosen where dependences ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003